A time-implicit filling algorithm
نویسندگان
چکیده
منابع مشابه
Efficient Implicit Time-Marching Methods Using a Newton-Krylov Algorithm
The numerical behavior of two implicit time-marching methods is investigated in solving two-dimensional unsteady compressible flows. The two methods are the second-order multistep backward differencing formula and the fourth-order multistage explicit first stage, single-diagonal coefficient, diagonally implicit Runge-Kutta scheme. A Newton-Krylov method is used to solve the nonlinear problem ar...
متن کاملA topology-based filling algorithm
In this paper we present a fast-recursive fully automated topology-based algorithm for filling in the interiors of objects that appear in a binary image. The algorithm is based on two topological properties of the image contours: perimeter coincidence and interiority. Based on these parameters the algorithm performs a tree-structured region classification. The final filling is done according to...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Hole-Filling Algorithm for Triangular Meshes
Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the process of surface reconstruction . Our method can be applied to holes with non-planar geometry as w...
متن کاملA New Implicit Finite Difference Method for Solving Time Fractional Diffusion Equation
In this paper, a time fractional diffusion equation on a finite domain is con- sidered. The time fractional diffusion equation is obtained from the standard diffusion equation by replacing the first order time derivative by a fractional derivative of order 0 < a< 1 (in the Riemann-Liovill or Caputo sence). In equation that we consider the time fractional derivative is in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1994
ISSN: 0307-904X
DOI: 10.1016/0307-904x(94)90165-1